Scheduling batch processing: Genetic Algorithms Versus Mathematical Programming

نویسنده

  • Jerker Björkqvist
چکیده

Genetic algorithms have during the recent years gained popularity also in the domain of chemical engineering, among other applications for scheduling purposes. A genetic algorithm builds new sequences by combining and mutating previous sequences of genes, i.e. chromosomes, into a new set of chromosomes. In this new set, only the fittest survive, and the procedure is repeated. As a schedule in chemical batch plant can be seen as a sequence of starting points for the batches, the methodology of genetic algorithms can be applied also to batch scheduling. In this work, the genetic algorithm approach is used combined with a Discrete Event Simulation (DES) approach. Here the genetic algorithm determines the order of the batches, whereas the DES-approaches insert the batches in the actual schedule. Using this two-stage optimisation and some tuning of the DES procedures, schedules with similar objective function values as with mathematical optimisation can be achieved, but usually much faster, which is essential for operational scheduling systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine

Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...

متن کامل

The project portfolio selection and scheduling problem: mathematical model and algorithms

This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...

متن کامل

An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

متن کامل

New Formulation and Solution in PCB Assembly Systems with Parallel Batch processors

This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...

متن کامل

MULTI-OBJECTIVE ROUTING AND SCHEDULING IN FLEXIBLE MANUFACTURING SYSTEMS UNDER UNCERTAINTY

The efficiency of transportation system management plays an important role in the planning and operation efficiency of flexible manufacturing systems. Automated Guided Vehicles (AGV) are part of diversified and advanced techniques in the field of material transportation which have many applications today and act as an intermediary between operating and storage equipment and are routed and contr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005